Representing graphs implicitly using almost optimal space
نویسندگان
چکیده
منابع مشابه
Optimal Design Using Implicitly Given Function Sets
A system equation with certain properties describes implicitly function sets as the basis for an optimal design of a digital circuit. A necessary condition for the realization of a digital circuit is that the associated system equation is resolvable [2], [4]. This paper shows how the resolvability of the system equation can be checked and how the explicit description of the circuit functions ca...
متن کاملAlmost optimal sparsification of random geometric graphs
A random geometric irrigation graph Γn(rn, ξ) has n vertices identified by n independent uniformly distributed points X1, . . . , Xn in the unit square [0, 1]. Each point Xi selects ξi neighbors at random, without replacement, among those points Xj (j 6= i) for which ‖Xi − Xj‖ < rn, and the selected vertices are connected to Xi by an edge. The number ξi of the neighbors is an integer-valued ran...
متن کاملRepresenting Software Component Dependencies Using Conceptual Graphs
The problem being addressed is the definition and representation of dependencies among system and software components. “Dependency” is any situation involving two or more elements such that a change in one or more elements leads to a potential for change in one or more other elements. We establish a definition for dependency, an ontology of dependency types, and lay the groundwork for incorpora...
متن کاملRepresenting Multi-scale Datalog +/- Using Hierarchical Graphs
We introduce a multi scale knowledge representation and reasoning formalism of Datalog+/knowledge bases. This is de ned on a novel graph transformation system that highlights a new type of rendering based on the additional expansion of relation nodes. Querying and integration capabilities of our approach are based on a FOL sound and complete homomorphism.
متن کاملRepresenting Structured Objects using Description Graphs
State-of-the-art ontology languages are often not sufficiently expressive to accurately represent domains consisting of objects connected in a complex way. As a possible remedy, in our previous work we have proposed an extension of ontology languages with description graphs. In this paper, we extend this formalism by allowing for multiple graphs that can be combined in complex ways, thus obtain...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Applied Mathematics
سال: 2001
ISSN: 0166-218X
DOI: 10.1016/s0166-218x(00)00225-0